Strong Structural Controllability of Systems on Colored Graphs
نویسندگان
چکیده
منابع مشابه
Strong Structural Controllability of Linear Time-Varying Systems
In this note we consider continuous-time systems ẋ(t) = A(t)x(t) + B(t)u(t) as well as discrete-time systems x(t + 1) = A(t)x(t) + B(t)u(t) whose coefficient matrices A and B are not exactly known. More precisely, all that is known about the systems is their nonzero pattern, i.e., the locations of the nonzero entries in the coefficient matrices. We characterize the patterns that guarantee contr...
متن کامل06 Drawing Colored Graphs on Colored Points
Let G be a planar graph with n vertices whose vertex set is partitioned into subsets V0, . . . , Vk−1 for some positive integer 1 ≤ k ≤ n and let S be a set of n distinct points in the plane partitioned into subsets S0, . . . , Sk−1 with |Vi| = |Si| (0 ≤ i ≤ k − 1). This paper studies the problem of computing a crossing-free drawing of G such that each vertex of Vi is mapped to a distinct point...
متن کاملON CONTROLLABILITY AND OBSERVABILITY OF FUZZY CONTROL SYSTEMS
In order to more effectively cope with the real world problems of vagueness, imprecise and subjectivity, fuzzy event systems were proposed recently. In this paper, we investigate the controllability and the observability property of two systems that one of them has fuzzy variables and the other one has fuzzy coefficients and fuzzy variables (fully fuzzy system). Also, sufficient conditions for ...
متن کاملDrawing Colored Graphs on Colored Points
Let G be a planar graph with n vertices whose vertex set is partitioned into subsets V0, . . . , Vk−1 for a positive integer 1 ≤ k ≤ n and let S be a set of n distinct points in the plane partitioned into subsets S0, . . . , Sk−1 with |Vi| = |Si| (0 ≤ i ≤ k − 1). This paper studies the problem of computing a crossing-free drawing of G such that each vertex of Vi is mapped to a distinct point of...
متن کاملStrong Alliances in Graphs
For any simple connected graph $G=(V,E)$, a defensive alliance is a subset $S$ of $V$ satisfying the condition that every vertex $vin S$ has at most one more neighbour in $V-S$ than it has in $S$. The minimum cardinality of any defensive alliance in $G$ is called the alliance number of $G$, denoted $a(G)$. In this paper, we introduce a new type of alliance number called $k$-strong alliance numb...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Automatic Control
سال: 2020
ISSN: 0018-9286,1558-2523,2334-3303
DOI: 10.1109/tac.2019.2948425